Exponential Sums, Cyclic Codes and Sequences: the Odd Characteristic Kasami Case

نویسندگان

  • Jinquan Luo
  • Yuansheng Tang
  • Hongyu Wang
چکیده

Let q = p with n = 2m and p be an odd prime. Let 0 ≤ k ≤ n − 1 and k 6= m. In this paper we determine the value distribution of following exponential(character) sums

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic Codes and Sequences from Kasami-Welch Functions

Let q = 2, 0 ≤ k ≤ n− 1 and k 6= n/2. In this paper we determine the value distribution of following exponential sums

متن کامل

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions

Let q = p with p be an odd prime. Let 0 ≤ k ≤ n − 1 and k 6= n/2. In this paper we determine the value distribution of following exponential(character) sums

متن کامل

Performance Analysis and Comparison of Spreading Codes in Linear Multi-User Detectors for DS-CDMA System

Direct Sequence Code Division Multiple Access (DS-CDMA) system is well known wireless technology. This system suffers from MAI (Multiple Access Interference) caused by Direct Sequence users. Multi-User Detection schemes were introduced to detect the users’ data in presence of MAI. Linear Multi-user Detectors and conventional Matched Filter (MF) are simulated using PN and even kasami sequences a...

متن کامل

Performance Comparison of Spreading Codes in Linear Multi- User Detectors for DS-CDMA System

Direct Sequence Code Division Multiple Access (DS-CDMA) system is well known wireless technology. This system suffers from MAI (Multiple Access Interference) caused by Direct Sequence users. Multi-User Detection schemes were introduced to detect the users’ data in presence of MAI. Linear Multi-user Detectors and conventional Matched Filter (MF) are simulated using gold, PN and even kasami seque...

متن کامل

The Complete Weight Enumerator of Several Cyclic Codes

Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime p, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding exponential sums. As applications of this general strategy, we determine the complete weight enumerator of several p-ary cyclic codes and give some examples t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0902.4508  شماره 

صفحات  -

تاریخ انتشار 2009